An $\tilde{O}(\log^{2}(N))$ time primality test for generalized Cullen numbers
نویسندگان
چکیده
منابع مشابه
AN Õ(log(N)) TIME PRIMALITY TEST FOR GENERALIZED CULLEN NUMBERS
Generalized Cullen Numbers are positive integers of the form Cb(n) := nb n + 1. In this work we generalize some known divisibility properties of Cullen Numbers and present two primality tests for this family of integers. The first test is based in the following property of primes from this family: nb n ≡ (−1)b (mod nbn +1). It is stronger and has less computational cost than Fermat’s test (to b...
متن کاملAn Õ(log2(N)) time primality test for generalized Cullen numbers
Generalized Cullen Numbers are positive integers of the form Cb(n) := nb n + 1. In this work we generalize some known divisibility properties of Cullen Numbers and present two primality tests for this family of integers. The first test is based in the following property of primes from this family: nb n ≡ (−1)b (mod nbn +1). It is stronger and has less computational cost than Fermat’s test (to b...
متن کاملFast Primality Proving on Cullen Numbers
We present a unconditional deterministic primality proving algorithm for Cullen numbers. The expected running time and the worst case running time of the algorithm are Õ(logN) bit operations and Õ(logN) bit operations, respectively.
متن کاملA Probabilistic Primality test Based on the Properties of Certain Generalized Lucas Numbers
After defining a class of generalized Fibonacci numbers and Lucas numbers, we characterize the Fibonacci pseudoprimes of the mth kind. In virtue of the apparent paucity of the composite numbers which are Fibonacci pseudoprimes of the mth kind for distinct values o f the integral parameter m , a method, which we believe to be new, for finding large probable primes is proposed. An efficient compu...
متن کاملRabin-miller Primality Test: Composite Numbers Which Pass It
The Rabin-Miller primality test is a probabilistic test which can be found in several algebraic computing systems (such as Pari, Maple, ScratchPad) because it is very easy to implement and, with a reasonable amount of computing, indicates whether a number is composite or "probably prime" with a very low probability of error. In this paper, we compute composite numbers which are strong pseudopri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2011
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-2011-02489-0